Hyperdiscriminant Polytopes, Chow Polytopes, and Mabuchi Energy Asymptotics

نویسنده

  • SEAN TIMOTHY PAUL
چکیده

Let X ↪→ P be a smooth, linearly normal algebraic variety. It is shown that the Mabuchi energy of (X,ωFS |X) restricted to the Bergman metrics is completely determined by the X-hyperdiscriminant of format (n− 1) and the Chow form of X . As a corollary it is shown that the Mabuchi energy is bounded from below for all degenerations in G if and only if the hyperdiscriminant polytope dominates the Chow polytope for all maximal algebraic tori H of G. CONTENTS

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discriminant Polytopes, Chow Polytopes, and K-energy Asymptotics on Algebraic Curves

LetX ↪→ P be a smooth, linearly normal algebraic curve. We show that the asymptotics of the Mabuchi energy are completely determined by the discriminant polytope and the Chow polytope of X . From this we deduce a new and entirely algebraic proof that the Mabuchi energy of the rational normal curve of degree d ≥ 2 is bounded below along all degenerations. We conclude that the Moser-Trudinger-Ono...

متن کامل

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

متن کامل

Hypercube Related Polytopes

Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

Brownian limits, local limits, extreme value and variance asymptotics for convex hulls in the ball

The paper [40] establishes an asymptotic representation for random convex polytope geometry in the unit ball Bd, d ≥ 2, in terms of the general theory of stabilizing functionals of Poisson point processes as well as in terms of the so-called generalized paraboloid growth process. This paper further exploits this connection, introducing also a dual object termed the paraboloid hull process. Via ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009